Lower Bounds for Bounded Depth Frege Proofs via Buss-Pudlák Games

We present a simple proof of the bounded-depth Frege lower bounds of Pitassi et. al. and Krajı́ček et. al. for the pigeonhole principle. Our method uses the interpretation of proofs as two player games given by Pudlák and Buss. Our lower bound is conceptually simpler than previous ones, and relies on tools and intuition that are well-known in the context of computational complexity. This makes the lower bound of Pitassi et. al. and Krajı́ček et. al. accessible to the general computational complexity audience. We hope this new view will open new directions for research in proof complexity. Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA 02139. Email: [email protected] †Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139. Email: [email protected] 1 E leronic C olquium on C om putional C om plxity, R eort N o. 4 (203)